On the Optimality of Secret Key Agreement via Omniscience

Information-Theoretic Secret Key Agreement

Pairwise Secret Key Agreement based on Location-derived Common Randomness

A source model of key sharing between three users is considered in which each pair of them wishes to agree on a secret key hidden from the remaining user. There are ratelimited public channels for communications between the users. We give an inner bound on the secret key capacity region in this framework. Moreover, we investigate a practical setup in which localization information of the users ...

On Key Agreement and Conference Key Agreement

An attack is demonstrated on a previously proposed class of key agreement protocols. Analysis of the attack reveals that a small change in the construction of the protocols is suucient to prevent the attack. The insight gained allows a generalisation of the class to a new design for conference key agreement protocols.

Information-Theoretic Secret-Key Agreement: The Asymptotically Tight Relation Between the Secret-Key Rate and the Channel Quality Ratio

Information-theoretically secure secret-key agreement between two parties Alice and Bob is a well-studied problem that is provably impossible in a plain model with public (authenticated) communication, but is known to be possible in a model where the parties also have access to some correlated randomness. One particular type of such correlated randomness is the so-called satellite setting, wher...

Efficient One-Way Secret-Key Agreement and Private Channel Coding via Polarization

We introduce explicit schemes based on the polarization phenomenon for the task of secret-key agreement from common information and one-way public communication as well as for the task of private channel coding. Our protocols are distinct from previously known schemes in that they combine two practically relevant properties: they achieve the ultimate rate—defined with respect to a strong secrec...